A new geometric approach for sensitivity analysis in linear programming

In this paper, we present a new geometric approach for sensitivity analysis in linear programming that is computationally practical decision-maker to study the behavior of optimal solution problem under changes program data. First, fix feasible domain (fix constraints). Then, geometrically formulate problem. Next, give equivalent formulation using notions affine geometry which consists write coefficient vector objective function polar coordinate and determining all angles remains unchanged. Finally, presented detail illustrated with numerical example.